package A2019;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.Iterator;
import java.util.List;
import java.util.Scanner;

public class Denug {
	static List<knot> arr=new ArrayList<>();
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		knot n=new knot();
		for (int i = 0; i < 5; i++) {
			int j=sc.nextInt();
			n.setX(i);
			n.setY(j);
		}
//		Collections.sort(arr);
		for (Iterator it = arr.iterator(); it.hasNext();) {
			knot k = (knot) it.next();
//			System.out.println(k.x+" "+k.y);
		}

	}
	static boolean compare(knot a,knot b){
		return a.y<b.y;
	}
}

class knot {
	int x,y;
	public int getX() {
		return x;
	}
	public void setX(int x) {
		this.x = x;
	}
	public int getY() {
		return y;
	}
	public void setY(int y) {
		this.y = y;
	}
//	knot(int x,int y){
//		this.x=x;
//		this.y=y;
//	}
}